package leetcode.weekly.week303;

//Solution1Test
public class Solution1 {
	public char repeatedCharacter(String s) {
		boolean[] h = new boolean[128];
		char[] cs = s.toCharArray();
		for (int i = 0; i < cs.length; i++) {
			char c = cs[i];
			if (h[c]) {
				return c;
			} else {
				h[c] = true;
			}
		}
		return ' ';
	}

}
